3-Col problem modelling using simple kernel P systems

نویسندگان

  • Marian Gheorghe
  • Florentin Ipate
  • Raluca Lefticaru
  • Mario J. Pérez-Jiménez
  • Adrian Turcanu
  • Luis Valencia-Cabrera
  • Manuel García-Quismondo
  • Laurentiu Mierla
چکیده

Marian Gheorghea,b∗, Florentin Ipate, Raluca Lefticaru, Mario J. Pérez-Jiménez, Adrian Ţurcanu, Luis Valencia Cabrera, Manuel Garćıa-Quismondo, Laurenţiu Mierlă Department of Computer Science, University of Sheffield, Portobello Street, Regent Court, Sheffield, S1 4DP, UK; Department of Mathematics and Computer Science, University of Pitesti, Str Targu din Vale, 1, Pitesti, Romania; Research Group on Natural Computing, Dpt. of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n. 41012, Sevilla, Spain

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel principal component analysis from a data modelling point of view

I show an example of how the principal component analysis method can be used for solving a specific computer vision problem—the one of fitting an ellipse to a set of points. In the example, the feature map is given (postulated) as part of the problem specification. More generally, the feature map in the kernel principal component analysis has the interpretation of the model class in data modell...

متن کامل

Kernel P Systems: Applications and Implementations

This paper explores the modelling capacities of a new class of P systems, called kernel P systems (kP systems). A specific language for describing kP systems and its translation into Promela, the specification language of Spin, are described. This Promela specification has been further used for simulation and property verification with the Spin model checker. Also, a parallel implementation on ...

متن کامل

An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function

In this paper, an interior-point algorithm  for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...

متن کامل

Extended Simulation and Verification Platform for Kernel P Systems

Kernel P systems integrate in a coherent and elegant manner many of the features of di↵erent P system variants, successfully used for modelling various applications. In this paper, we present our initial attempt to extend the software framework developed to support kernel P systems: a formal verification tool based on the NuSMV model checker and a large scale simulation environment based on FLA...

متن کامل

A Note on Solving Prandtl's Integro-Differential Equation

A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 90  شماره 

صفحات  -

تاریخ انتشار 2013